Polynomial and Matrix Fraction Description
نویسنده
چکیده
Glossary Canonical realization: A state-space realization that has specific properties that makes it unique. Characteristic polynomial: The scalar denominator of a transfer function. Column-reduced: A polynomial matrix with non-singular column leading coefficient matrix. Coprime: See relatively prime. Denominator polynomial: The polynomial appearing in the denominator of a rational transfer function. Elementary operations: Operations that are performed to reduce a polynomial matrix to some special form. Greatest common divisor: A highest degree common factor that can be extracted from two polyno-mials. Hermite form: A triangular canonical form of a polynomial matrix. Irreducible: A transfer function is irreducible when its numerator and denominator polynomials are relatively prime. Leading coefficient matrix: The constant matrix whose entries are built from coefficients of highest powers of the entries of a polynomial matrix. Left MFD: An MFD where the denominator polynomial matrix enters from the left. Matrix fraction description: Ratio of two polynomial matrices describing a matrix transfer function. MFD: See matrix fraction description. MIMO: Multi-input multi-output system. Minimal: A state-space realization is minimal if it has the lowest possible dimension. Monic: A polynomial is monic when its leading coefficient is equal to one. Numerator polynomial: The polynomial appearing in the numerator of a rational transfer function. Polynomial matrix: A matrix with polynomial entries, or equivalently a polynomial with matrix coefficients. Polynomial echelon form: See Popov form. Polynomial Toolbox: The Matlab Toolbox for polynomials, polynomial matrices and their application in systems, signals and control. Popov form: A canonical form of a polynomial matrix with a special structure. Proper: A matrix transfer function is proper if the degree of the denominator polynomial of each entry is greater than or equal to the degree of the numerator polynomial. State-space realization: The state-space equation describing internally a transfer function. Realization: See state-space realization. Relatively prime: Two polynomials or polynomial matrices are relatively prime if they have no common factor. Right MFD: An MFD where the denominator polynomial matrix enters from the right. Row-reduced: A polynomial matrix with non-singular row leading coefficient matrix. SISO: Single-input single-output system. Transfer function: Rational matrix relating the Laplace or z-transform of the output to the Laplace or z-transform of the input, in the absence of initial conditions. Unimodular: A polynomial matrix with a non-zero constant determinant Summary This article illustrates how polynomials and polynomial matrices can be used to describe linear systems. The focus is put on the transformation to and from the state-space …
منابع مشابه
Determination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial
Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...
متن کاملMultivariable Least Squares Frequency Domain Identification using Polynomial Matrix Fraction Descriptions
In this paper an approach is presented to estimate a linear multivariable model on the basis of (noisy) frequency domain data via a curve tting procedure. The multivariable model is parametrized in either a left or a right polynomial matrix fraction description and the parameters are computed by using a two-norm minimization of a multivariable output error. Additionally, input-output or element...
متن کاملNumerical Computation of Minimal Polynomial Bases: A Generalized Resultant Approach
We propose a new algorithm for the computation of a minimal polynomial basis of the left kernel of a given polynomial matrix F (s): The proposed method exploits the structure of the left null space of generalized Wolovich or Sylvester resultants to compute row polynomial vectors that form a minimal polynomial basis of left kernel of the given polynomial matrix. The entire procedure can be imple...
متن کاملAlgebraic adjoint of the polynomials-polynomial matrix multiplication
This paper deals with a result concerning the algebraic dual of the linear mapping defined by the multiplication of polynomial vectors by a given polynomial matrix over a commutative field
متن کاملMatrix Kummer-Pearson VII Relation and Polynomial Pearson VII Configuration Density
Abstract. A case of the matrix Kummer relation of Herz (1955) based on the Pearson VII type matrix model is derived in this paper. As a con- sequence, the polynomial Pearson VII configuration density is obtained and this sets the corresponding exact inference as a solvable aspect in shape theory. An application in postcode recognition, including a nu- merical comparison between the exact poly...
متن کامل